An extension of Stanley's chromatic symmetric function to binary delta-matroids

نویسندگان

چکیده

Stanley's symmetrized chromatic polynomial is a generalization of the ordinary to graph invariant with values in ring polynomials infinitely many variables. The specialization one. To each orientable embedded single vertex, simple associated, which called intersection graph. As result, we can define for any vertex. Our goal extend graphs arbitrary number vertices, and not necessarily orientable. In contrast well-known extensions of, say, Tutte from abstract [4], our extension based on structure underlying additional information about embedding. Instead, consider binary delta-matroid associated an extended Stanley as delta-matroids. We show that, similarly graphs, satisfies 4-term relations that introduce delta-matroids [7]. For function produces knot by means correspondence between knots. Analogously may interpret suggested links, using links.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Noncommutative Chromatic Symmetric Function

In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...

متن کامل

A Chromatic Symmetric Function in Noncommuting Variables

In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...

متن کامل

A Two Parameter Chromatic Symmetric Function

We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in terms of the monomial symmetric functions, mλ, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete gr...

متن کامل

A Quasisymmetric Function Generalization of the Chromatic Symmetric Function

The chromatic symmetric function XG of a graph G was introduced by Stanley. In this paper we introduce a quasisymmetric generalization X G called the k-chromatic quasisymmetric function of G and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of XG to χG(λ), the chromatic polynomial, we also define a generalization χ k G(λ) and sh...

متن کامل

An extension of the bivariate chromatic polynomial

K.Dohmen, A.Pönitz and P.Tittman (2003), introduced a bivariate generalization of the chromatic polynomial P (G, x, y) which subsumes also the independent set polynomial of I. Gutman and F. Harary, (1983) and the vertex-cover polynomial of F.M. Dong, M.D. Hendy, K.T. Teo and C.H.C. Little (2002). We first show that P (G, x, y) has a recursive definition with respect to three kinds of edge elimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2021

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2021.112549